The cyclic matching sequenceability of regular graphs
نویسندگان
چکیده
The cyclic matching sequenceability of a simple graph G, denoted cms ( G ) , is the largest integer s for which there exists ordering edges so that every set consecutive forms matching. In this paper we consider minimum k-regular graphs. We completely determine 2-regular graphs, and give bounds k ⩾ 3.
منابع مشابه
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملCyclic matching sequencibility of graphs
We define the cyclic matching sequencibility of a graph to be the largest integer d such that there exists a cyclic ordering of its edges so that every d consecutive edges in the cyclic ordering form a matching. We show that the cyclic matching sequencibility of K2m and K2m+1 equals m− 1.
متن کاملMatching extensions of strongly regular graphs
Let J3 be the number of vertices commonly adjacent to any pair of non-adjacent vertices. It is proved that every strongly regular graph with even order and J3 ~ 1 is l-extendable. We also show that every strongly regular graph of degree at least 3 and cyclic edge connecti vity at least 3k -3 is 2-extendab Ie. Strongly regular graphs of k even order and of degree k at least 3 with J3 ~"3 are 2-e...
متن کاملMatching and edge-connectivity in regular graphs
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper, we characterized when equality holds. In this paper, we prove a lower bound for the minimum size of a maximum matching in an l-edge-connected k-regular graph with n vertices, for l ≥ 2 and k ≥ 4. Again it is sharp for...
متن کاملRandomized Online Matching in Regular Graphs
We study the classic bipartite matching problem in the online setting, first introduced in the seminal work of Karp, Vazirani and Vazirani. Specifically, we consider the problem for the well-studied class of regular graphs. Matching in this class of graphs was studied extensively in the offline setting. In the online setting, an optimal deterministic algorithm, as well as efficient algorithms u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22701